"查查詞典"手機版
千萬人都在用的超大詞匯詞典翻譯APP
In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite state machine where from each state and a given input symbol the automaton may jump into several possible next states. This distinguishes it from the deterministic finite automaton (DFA), where the next possible state is uniquely determined.
詳細百科解釋